package com.google.code.numbertheory;

/**
 * Least common multiple of two integers a and b is the smallest positive integer
 * that is a multiple both of a and of b.
 */
public class LeastCommonMultiple {
    public static int lcm(int a, int b) {
        return a * b / GreatestCommonDivisor.gcd(a, b);
    }
}
